Coinductive Predicates as Final Coalgebras
نویسندگان
چکیده
We show that coinductive predicates expressing behavioural properties of infinite objects can be themselves expressed as final coalgebras in a category of relations. The well-known case of bisimulation will simply be a special case of such final predicates. We will show how some useful pointwise and mixed properties of streams can be modelled in this way.
منابع مشابه
Coinductive predicates and final sequences in a fibration
Coinductive predicates express persisting “safety” specifications of transition systems. Previousobservations by Hermida and Jacobs identify coinductive predicates as suitable final coalgebrasin a fibration—a categorical abstraction of predicate logic. In this paper we follow the spirit ofa seminal work by Worrell and study final sequences in a fibration. Our main contribution i...
متن کاملComputable Functions on Final Coalgebras
This paper tackles computability issues on final coalgebras and tries to shed light on the following two questions: First, which functions on final coalgebras are computable? Second, which formal system allows us to define all computable functions on final coalgebras? In particular, we give a definition of computability on final coalgebras, deriving from the theory of effective domains. We then...
متن کاملCoinductive Properties of Lipschitz Functions on Streams
A simple hierarchical structure is imposed on the set of Lipschitz functions on streams (i.e. sequences over a fixed alphabet set) under the standard metric. We prove that sets of non-expanding and contractive functions are closed under a certain coiterative construction. The closure property is used to construct new final stream coalgebras over finite alphabets. For an example, we show that th...
متن کاملCoalgebras in functional programming and type theory
This is a survey article on the use of coalgebras in functional programming and type theory. It presents the basic theory underlying the implementation of coinductive types, families and predicates. It gives an overview of the application of corecursive methods to the study of general recursion, formal power series, tabulations of functions on inductive data. It also sketches some advanced topi...
متن کاملRealization of Coinductive Types
We give an explicit combinatorial construction of final coalgebras for a modest generalization of polynomial functors on Set. Type signatures are modeled as directed multigraphs instead of endofunctors. The final coalgebra for a type signature F involves the notion of Brzozowski derivative on sets of paths in F .
متن کامل